Type Reconstruction for Linear -Calculus with I/O Subtyping
نویسندگان
چکیده
منابع مشابه
Type Reconstruction for Linear Pi-Calculus with I/O Subtyping
Powerful concurrency primitives in recent concurrent languages and thread libraries provide great flexibility about implementation of high-level features like concurrent objects. However, they are so low-level that they often make it difficult to check global correctness of programs or to perform non-trivial code optimization, such as elimination of redundant communication. In order to overcome...
متن کاملTermination in a π-calculus with subtyping
We present a type system to guarantee termination of π-calculus processes that exploits input/output capabilities and subtyping, as originally introduced by Pierce and Sangiorgi, in order to analyse the usage of channels. Our type system is based on Deng and Sangiorgi’s level-based analysis of processes. We show that the addition of i/o-types makes it possible to typecheck processes where a for...
متن کاملSession typing and asynchronous subtyping for the higher-order π-calculus
This paper proposes a session typing system for the higher-order π-calculus(the HOπ-calculus) with asynchronous communication subtyping, which al-lows partial commutativity of actions in higher-order processes. The systemenables two complementary kinds of optimisation of communication code,mobile code and asynchronous permutation of session actions, within pro-cesses tha...
متن کاملFull Abstraction in a Subtyped pi-Calculus with Linear Types
We introduce a concise pi-calculus with directed choices and develop a theory of subtyping. Built on a simple behavioural intuition, the calculus offers exact semantic analysis of the extant notions of subtyping in functional programming languages and session-based programming languages. After illustrating the idea of subtyping through examples, we show type-directed embeddings of two known sub...
متن کاملA Pure Calculus of Subtyping, and Applications (Outline)
One of the problems in understanding object-oriented languages is understanding their type systems, e.g. making sure that they are sound. To this end, I propose a typed foundation for object-oriented languages, based on a small typed λ-calculus with polymorphism and subtyping.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 161 شماره
صفحات -
تاریخ انتشار 2000